منابع مشابه
Real-Time Recognition of Cyclic Strings by One-Way and Two-Way Cellular Automata
This paper discusses real-time language recognition by 1dimensional one-way cellular automata (OCAs) and two-way cellular automata (CAs), focusing on limitations of the parallel computation power. To clarify the limitations, we investigate real-time recognition of cyclic strings of the form uk with u ∈ {0, 1}+ and k ≥ 2. We show a version of pumping lemma for recognizing cyclic strings by OCAs,...
متن کاملOn the power of one-way bounded cellular time computers
Comparisons of diierent cellular devices and the investigation of their computing power can be made in terms of their capabilities to time-construct and time-compute functions. Time-construction means that a distinguished cell has to enter distinguished states exactly at the time steps f (1); f (2); : : :, whereas time-computation requires the distinguished cell to enter a distinguished state r...
متن کاملA Simulation of Oblivious Multi-head One-way Finite Automata by Real-time Cellular Automata
In this paper, we present the simulation of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head one-way finite automata and is characterised by having its heads moving only forward, on a trajectory that only depends on the length of the input. While the original finite automaton works in linear time, its corresponding c...
متن کاملRecognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.
متن کاملA Time Hierarchy for Bounded One-Way Cellular Automata
Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an infinite hierarchy of properly included OCA-language families in that range. A generalization of a method in [10] is shown that provides ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00212-2